Compositional Probabilistic Model Checking with String Diagrams of MDPs
نویسندگان
چکیده
Abstract We present a compositional model checking algorithm for Markov decision processes, in which they are composed the categorical graphical language of string diagrams . The computes optimal expected rewards. Our theoretical development is supported by category theory, while what we call decomposition equalities rewards act as key enabler. Experimental evaluation demonstrates its performance advantages.
منابع مشابه
Probabilistic Bisimulations for PCTL Model Checking of Interval MDPs
Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models ...
متن کاملCompositional probabilistic verification through multi-objective model checking
Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewar...
متن کاملParameterized Compositional Model Checking
The Parameterized Compositional Model Checking Problem (PCMCP) is to decide, using compositional proofs, whether a property holds for every instance of a parameterized family of process networks. Compositional analysis focuses attention on the neighborhood structure of processes in the network family. For the verification of safety properties, the PCMCP is shown to be much more tractable than t...
متن کاملCompositional Model Checking
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general fram...
متن کاملCompositional Model Checking
Modern software, which is often concurrent and distributed, must be extremely reliable and correct. Model checking [3] is a technique for automating high-quality assurance of software. Given a finite state model of a system and a property, usually expressed as an automaton or a temporal logic formula, model checking systematically goes through all the possible system behaviors and checks them f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-37709-9_3